Parallel stochastic methods for PDE based grid generation
نویسندگان
چکیده
The efficient generation of meshes is an important step in the numerical solution of various problems in physics and engineering. Here we are interested in situations where global mesh quality and coupling to the physical solution is important. Hence we consider PDE based mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using domain decomposition that is suitable for an implementation on parallel computing architectures. The method uses the stochastic representation of the exact solution of a linear mesh generator of Winslow type to find the points of the adaptive mesh along the sub-domain interfaces. The meshes over the single sub-domains can then be obtained completely independently of each other using the probabilistically computed solutions along the interfaces as boundary conditions for the linear mesh generator. Further improvements through the use of interpolation along the sub-domain interfaces and smoothing of mesh candidates are discussed. Various examples of meshes constructed using this stochastic– deterministic domain decomposition technique are shown and compared to the respective single domain solutions using a representative mesh quality measure.
منابع مشابه
Menus-pgg : a Mapping Environment for Unstructured and Structured Numerical Parallel Grid Generation
MENUS-PGG is a problem solving environment (PSE) for developing parallel algorithms that generate structured and unstructured static and adaptive grids (or meshes) required for the implementation of scalable parallel partial di erential equation (PDE) solvers based on domain decomposition methods. Whereas the rst generation PSEs for the numerical solution of PDEs on distributed memory multiproc...
متن کاملA stochastic scheduling algorithm for precedence constrained tasks on Grid
This paper addresses the problems in scheduling a precedence constrained tasks of parallel application with random tasks processing time and edges communication time on Grid computing systems so as to minimize the makespan in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. The problem is first formulated in a form of stoc...
متن کاملParallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملDeveloping the Next Generation Scalable Exascale Uncertainty Quantification Methods
Predictive modeling of multiscale and multiphysics systems requires accurate data-driven characterization of the input uncertainties and understanding how they propagate across scales and alter the final solution. We will address three major current limitations in modeling stochastic systems: (1) Most of current uncertainty quantification methods cannot detect and handle discontinuity in the pa...
متن کاملFast Algorithms for the Solution of Stochastic Partial Differential Equations
Title of dissertation: FAST ALGORITHMS FOR THE SOLUTION OF STOCHASTIC PARTIAL DIFFERENTIAL EQUATIONS Christopher W. Miller, Doctor of Philosophy, 2012 Dissertation directed by: Professor Howard Elman Department of Computer Science Institute for Advanced Computer Studies We explore the performance of several algorithms for the solution of stochastic partial differential equations including the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 68 شماره
صفحات -
تاریخ انتشار 2014